Information Theory Based Estimator of the Number of Sources in a Sparse Linear Mixing Model Radu Balan University of Maryland Department of Mathematics, Center for Scientific Computation And Mathematical Modeling, and No

Source URL: www.math.umd.edu

number of departures 250 education-dominated chain types leisure-dominated chain types

Source URL: www.strc.ch

• Multi-agent systems
• Transport
• Complex systems theory
• Models of computation
• Digital electronics
• Systems science
• Scientific modeling
• Simulation
• MATSim
• Traffic simulation
• Agent-based model
• Traffic flow

Agent-Based Activities Planning for an Iterative Traffic Simulation of Switzerland – Activity Time Allocation Michael Balmer, Dept. of Computer Science, ETH Zurich ¨ Bryan Raney, Dept. of Computer Science, ETH Zurich

Source URL: www.strc.ch

• Multi-agent systems
• Transportation planning
• Scientific modeling
• Complex systems theory
• Models of computation
• Traffic simulation
• Agent-based model
• Simulation
• Route assignment
• Traffic congestion
• Logic simulation

V22: Honors Theory of Computation Problem Set 4 Solutions Problem 1 1. L1 = {hM, w, ti : M halts on w in t steps} Answer: L1 is decidable. The following TM decides L1 :

Source URL: ftp.cs.nyu.edu

Computation and theory of extended Mordell-Tornheim-Witten sums David H. Bailey http://www.davidhbailey.com Computational Research Dept., Lawrence Berkeley National Lab (retired) Computer Science Department, University o

Source URL: www.davidhbailey.com

Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=

Source URL: www.math.ru.nl

• Mathematics
• Discrete mathematics
• Number theory
• Modular arithmetic
• Integer sequences
• Finite fields
• Quadratic residue
• Prime number
• Quadratic reciprocity
• XTR
• Coprime integers
• Factorial

CSCI-UA: Theory of Computation Problem Set 2 All problems are worth 10 points. Collaboration is allowed, but you must write your own solutions. Write the names of your collaborators (and your own!). Unless state

Source URL: ftp.cs.nyu.edu

Neural Computation and the Computational Theory of Cognition1 Gualtiero Piccinini Departments of Philosophy and Psychology, Center for Neurodynamics University of Missouri – St. Louis St. Louis, MO, USA Email: piccinin

Source URL: www.umsl.edu

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Source URL: www.cs.cornell.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial hierarchy
• P versus NP problem
• IP
• True quantified Boolean formula
• NP
• PP
• Oracle machine
• PSPACE-complete
• Polynomial-time reduction

Journal de Theorie des Nombres de Bordeaux), 283{313 On the computation of quadratic 2-class groups par Wieb BOSMA et Peter STEVENHAGEN Resume. Nous decrivons un algorithme d^u a Gauss, Shanks et Lagarias

Source URL: www.math.ru.nl

• Algebra
• Mathematics
• Abstract algebra
• Quadratic forms
• Algebraic number theory
• Binary quadratic form
• Discriminant
• Factorization
• Ideal class group
• Genus of a quadratic form
• Witt group